Improved Estimation of the Size of the State Space of Petri Nets for the Analysis of Reachability Problems
نویسنده
چکیده
The complete exploration of large system states modeled with Petri net (PN) systems demonstrates state space explosion, limiting reachability analysis. The calculation of the number of states (samples) necessary to conduct a statistical hypothesis test for reachability problems of PN systems is discussed in this paper. The calculation is based on the estimation of the size of the state space. This paper presents two estimators of the size of the state-space for bounded PN systems. The estimators are improved extensions of existing ones and are based on the simple elimination of unreachable markings. The estimations will be used in the calculation of the number of necessary samples to collect in the partial exploration of the state space. The improved estimation obtained in one example presents larger benefits than with the former estimator. Key-Words: Bounded Petri nets, State space size, Reachability, Size estimation, Hypothesis test
منابع مشابه
Reachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملModeling and Performance Evaluation of Energy Consumption in S-MAC Protocol Using Generalized Stochastic Petri Nets
One of the features of wireless sensor networks is that the nodes in this network have limited power sources. Therefore, assessment of energy consumption in these networks is very important. What has been common practice has been the use of traditional simulators to evaluate the energy consumption of the nodes in these networks. Simulators often have problems such as fluctuating output values i...
متن کاملAn Algorithm for Petri Nets Reachability by Unfoldings
This paper proposes an algorithm for analyzing the reachability property of Petri nets by the use of unfoldings. It is known that analyzing the reachability by using unfoldings requires exponential time and space to the size of unfolding. The algorithm is based on the branch and bound technique, and experimental results show efficiency of the algorithm. key words: Petri nets, unfoldings, reacha...
متن کاملSoccer Goalkeeper Task Modeling and Analysis by Petri Nets
In a robotic soccer team, goalkeeper is an important challenging role, which has different characteristics from the other teammates. This paper proposes a new learning-based behavior model for a soccer goalkeeper robot by using Petri nets. The model focuses on modeling and analyzing, both qualitatively and quantitatively, for the goalkeeper role so that we have a model-based knowledge of the ta...
متن کاملUsing Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کامل